Predictive Filtering and Smoothing of Short Records by using Maximum Entropy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Entropy for Collaborative Filtering

Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with respect to the size of the domain. Thus, support for higher-order interactions is generally not present. Second, the variables that we are conditioning upon vary for each query. That is, users label different variables dur...

متن کامل

Smoothing methods in maximum entropy language modeling

This paper discusses various aspects of smoothing techniques in maximum entropy language modeling, a topic not sufficiently covered by previous publications. We show (1) that straightforward maximum entropy models with nested features, e.g. tri–, bi–, and unigrams, result in unsmoothed relative frequencies models; (2) that maximum entropy models with nested features and discounted feature count...

متن کامل

an investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols

this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...

A Maximum Entropy Approach for Collaborative Filtering

Collaborative filtering (CF) involves predicting the preferences of a user for a set of items given partial knowledge of the user’s preferences for other items, while leveraging a database of profiles for other users. CF has applications e.g. in predicting Web sites a person will visit and in recommending products. Fundamentally, CF is a pattern recognition task, but a formidable one, often inv...

متن کامل

A Maximum Entropy Method for Particle Filtering

Standard ensemble or particle filtering schemes do not properly represent states of low priori probability when the number of available samples is too small, as is often the case in practical applications. We introduce here a set of parametric resampling methods to solve this problem. Motivated by a general H-theorem for relative entropy, we construct parametric models for the filter distributi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geophysical Journal International

سال: 1973

ISSN: 0956-540X,1365-246X

DOI: 10.1093/gji/35.1.380-a